On Infinite Words Obtained by Selective Substitution Grammars
نویسندگان
چکیده
We present a method of generating infinite words from selective substitution grammars introduced by Rozenberg (1977). Comparison is made with some of the well-known limiting processes and limit language families and certain closure properties are examined. A technique is given for obtaining infinite non-repetitive words. Several decidability results are established.
منابع مشابه
On a substitution subshift related to the Grigorchuk group
The substitution acts on words (finite sequences) over this alphabet as well as on infinite sequences. It is easy to observe that τ has a unique invariant sequence ω that is the limit of words τ (a), k = 1, 2, . . . . Let Ω be the smallest closed set of one-sided infinite sequences over the alphabet {a, b, c, d} that contains ω and is invariant under the shift σ (σ acts on sequences by deleting...
متن کاملCharacterization of Substitution Invariant Words Coding Exchange of Three Intervals
We study infinite words coding an orbit under an exchange of three intervals which have full complexity C(n) = 2n + 1 for all n ∈ N (non-degenerate 3iet words). In terms of parameters of the interval exchange and the starting point of the orbit we characterize those 3iet words which are invariant under a primitive substitution. Thus, we generalize the result recently obtained for Sturmian words.
متن کاملCharacterization of substitution invariant 3iet words
We study infinite words coding an orbit under an exchange of three intervals which have full complexity C(n) = 2n + 1 for all n ∈ N (non-degenerate 3iet words). In terms of parameters of the interval exchange and the starting point of the orbit we characterize those 3iet words which are invariant under a primitive substitution. Thus, we generalize the result recently obtained for sturmian words.
متن کاملTwo infinite hierarchies of languages defined by branching grammars
Two types of branching grammars are introduced inspired from Havel's works about branching automata. They naturally define two infinite hierarchies into the family of regular, respectively, linear languages. Homomorphic characterisations of regular and linear languages >n terms of branching languages are obtained. Finally, the relations between branching grammars and contextual grammars of [5] ...
متن کاملClustering for obtaining syntactic classes of words from automatically extracted LTAG grammars
We propose a method for obtaining syntactic classes of words from a lexicalized tree adjoining grammar (LTAG: Schabes, Abeillé and Joshi (1988)) automatically extracted from a corpus. Since elementary trees in LTAG grammars represent syntactic roles of a word, we can obtain syntactic classes by clustering words having the similar elementary trees. With our method, automatically extracted LTAG g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 39 شماره
صفحات -
تاریخ انتشار 1985